A Parallel Algorithm for Transitive Closure
نویسندگان
چکیده
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O(mn p ) local memory. The local computation of each processor is equal to the product of the number of edges and vertices of D that are stored in p.
منابع مشابه
The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملOn the PVM Computations of Transitive Closure and Algebraic Path Problems
We investigate experimentally, alternative approaches to the distributed parallel computation of a class of problems related to the generic transitive closure problem and the algebraic path problem. Our main result is the comparison of two parallel algorithms for transitive closure, { a straightforward coarse-grained parallel implementation of the Warshall algorithm named Block-Processing (whic...
متن کاملA Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering
We present a parallel algorithm to compute the transitive closure of a relation. The transitive closure operation has been recognized as an important extension of the relational algebra. The importance of the performance problem brought by its evaluation brings one to consider parallel execution strategies. Such strategies constitute one of the keys to efficiency in a very large data base envir...
متن کاملParallel Transitive Closure and Point Location in Planar Structures
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal O(logn) running time using n= logn processors in the EREW PRAM mod...
متن کاملA Parallel and Distributed Approach for Finding Transitive Closures of Data Records: A Proposal
In this paper, we propose an approach to find transitive closures on large data sets in distributed (i.e., parallel) environment. Finding transitive closures of data records is a preprocessing step of a two-step approach to data quality control, such as data accuracy, redundancy, consistency, currency and completeness. The objective of finding transitive closures is to reduce the number of reco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002